Noisy Channel Coding via Privacy Amplification and Information Reconciliation
نویسندگان
چکیده
منابع مشابه
Privacy Amplification Theorem for Noisy Main Channel
Secret key agreement protocol between legal parties based on reconciliation and privacy amplification procedure has been considered in [2]. The so called privacy amplification theorem is used to estimate the amount of Shannon’s information leaking to an illegal party (passive eavesdropper) about the final key. We consider a particular case where one of the legal parties (Alice) sends to another...
متن کاملSimple and Tight Bounds for Information Reconciliation and Privacy Amplification
Shannon entropy is a useful and important measure in information processing, for instance, data compression or randomness extraction, under the assumption—which can typically safely be made in communication theory—that a certain random experiment is independently repeated many times. In cryptography , however, where a system’s working has to be proven with respect to a malicious adversary, this...
متن کاملLinking Information Reconciliation and Privacy Ampliication ?
Information reconciliation and privacy ampliication are important tools in cryptography and information theory. Reconciliation allows two parties knowing correlated random variables, such as a noisy version of the partner's random bit string, to agree on a shared string. Privacy ampliication allows two parties sharing a partially secret string, about which an opponent has some partial informati...
متن کاملAsymptotic Bounds on Optimal Noisy Channel Quantization Via Random Coding
Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average r th-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability. The upper bound asymptoti-cally equals 2 ?rRg(;k;r) , where ...
متن کاملThe Noisy-Channel Coding Theorem
This is an exposition of two important theorems of information theory often singularly referred to as The Noisy-Channel Coding Theorem. Given a few assumptions about a channel and a source, the coding theorem demonstrates that information can be communicated over a noisy channel at a non-zero rate approximating the channel’s capacity with an arbitrarily small probability of error. It originally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2162226